package com.lht.leetcodeDemo;

import com.lht.leetcodeDemo.data.structure.TreeNode;

/**
 * 解题思路，是不断拿到中位数
 *
 * @author Eric
 * @version 1.0
 * @date 2019-12-12
 */
public class ConvertSortedArraytoBinarySearchTree {

    public TreeNode sortedArrayToBST(int[] nums) {
        return null;
    }

    public void sortedArray(int[] nums, TreeNode node, int l, int h) {
        if (h - l < 1) {

        }
    }

}
